Types and automata

Finite Automata and Isomorphism Types

: examining l2 teachers’ corrective feedback types in relation to learners’ uptake, proficiency levels, and context types

abstract this study investigates the teachers’ correction of students’ spoken errors of linguistic forms in efl classes, aiming at (a) examining the relationship between the learners’ proficiency level and the provision of corrective feedback types, (b) exploring the extent to which teachers’ use of different corrective feedback types is related to the immediate types of context in which err...

Multiparty Session Types Meet Communicating Automata

Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in characterising essential properties of communications such as freedom from deadlock and communication error, and buffer boundedness. CFSMs are known to be computationally hard: most of these properties are undecidable even in r...

Towards Tree Automata-based Success Types

Error detection facilities for dynamic languages are often based on unit testing. Thus, the advantage of rapid prototyping and flexibility must be weighed against cumbersome and time consuming test suite development. Lindahl and Sagonas’ success typings provide a means of static must-fail detection in Erlang. Due to the constraintbased nature of the approach, some errors involving nested tuples...

Multiparty Session Types as Communicating Automata: Characterisation and Synthesis

Multiparty session types is a type discipline that can ensure the safety and liveness of distributed peers via the global specification of the interaction. To construct a global specification from a set of distributed uncontrolled behaviours, this paper explores the problem of fully characterising multiparty session types in terms of communicating automata. We equip global and local session typ...